Qualitative Spatial Reasoning h la Allen: An Algebra for Cyclic Ordering of 2D Orientations
نویسندگان
چکیده
We define an algebra of ternary relations for cyclic ordering of 2D orientations, which is a refinement of the CYCORD theory. The algebra (1) contains atomic relations, hence 224 general relations, of which the usual CYCORD relation is a particular relation; and (2) is NP-complete, which is not surprising since the CYCORD theory is. We then provide the following: (1) a constraint propagation algorithm for the algebra; (2) a proof that the propagation algorithm polynomial, and complete for a subclass including all atomic relations; (3) a proof that another subclass, expressing only information on parallel orientations, is NP-complete; and (4) a solution search algorithm for a general problem expressed in the algebra. A comparison to related work indicates that the approach is promising.
منابع مشابه
Qualitative Spatial Reasoning a la Allen: An Algebra for Cyclic Ordering of 2D Orientations
We define an algebra of ternary relations for cyclic ordering of 2D orientations, which is a refinement of the CYCORD theory . The algebra (1) contains 24 atomic relations, hence 224 general relations, of which the usual CYCORD relation is a particular relation ; and (2) is NP-complete, which is not surprising since the CYCORD theory is . We then provide the following : (1) a constraint propaga...
متن کاملAn Algebra for Cyclic Ordering of 2D Orientations
We define an algebra of ternary relations for cyclic ordering of 2D orientations. The algebra (1) is a refinement of the CYCORD theory; (2) contains 24 atomic relations, hence 224 general relations, of which the usual CYCORD relation is a particular relation; and (3) is NP-complete, which is not surprising since the CYCORD theory is. We then provide: (1) a constraint propagation algorithm for t...
متن کاملAn Algebra for Cyclic Ordering of 2 D
We deene an algebra of ternary relations for cyclic ordering of 2D orientations. The algebra (1) is a reene-ment of the CYCORD theory; (2) contains 24 atomic relations, hence 2 24 general relations, of which the usual CYCORD relation is a particular relation; and (3) is NP-complete, which is not surprising since the CYCORD theory is. We then provide: (1) a constraint propagation algorithm for t...
متن کاملOn Deciding Consistency for CSPs of Cyclic Time Intervals
We consider reasoning in an algebra of cyclic time intervals recently known in the literature; the algebra, CZ.A, is somehow the cyclic time counterpart of Allen’s algebra of linear time intervals, 1277.A. A composition table has been built for C2¢4; the table can be used by a path consistency algorithm, such as Alien’s, to propagate knowledge expressed in the algebra as a constraint satisfacti...
متن کاملQualitative Subdivision Algebra: Moving towards the Quantitative
Qualitative Reasoning has achieved signiicant successes in providing abstractions for processes and functionality. However many important questions (e.g modeling shape) are not resolvable at purely qualitative levels, and traditional hybrid models have resorted to quantitative data when it came to these issues. This requires that diierent sets of data be maintained and updated continuously, and...
متن کامل